منابع مشابه
Oblivious Symmetric Alternation
We introduce a new class Op2 as a subclass of the symmetric alternation class Sp2. An O p 2 proof system has the flavor of an S p 2 proof system, but it is more restrictive in nature. In an Sp2 proof system, we have two competing provers and a verifier such that for any input, the honest prover has an irrefutable certificate. In an Op2 proof system, we require that the irrefutable certificates ...
متن کاملNotes on derandomising BPP
Notes from a paper by Nisan and Wigderson to show how to prove P = BPP starting from an assumption about the existence of a language in DTIME(2) which no subexponential circuits can approximate.
متن کاملBPP , Proof systems
We currently do not have a very good unconditional bound on the power of BPP — in particular, it could be that BPP = NEXP. Perhaps surprisingly, especially in light of the many randomized algorithms known, the current conjecture is that BPP is not more powerful than P. We will return to this point later in the semester when we talk about derandomization. What (unconditional) upper bounds can we...
متن کاملTowards NEXP versus BPP?
We outline two plausible approaches to improving the miserable state of affairs regarding lower bounds against probabilistic polynomial time (namely, the class BPP).
متن کاملRelative to P promise - BPP
We show that for determinictic polynomial time computation, oracle access to APP, the class of real functions approximable by probabilistic Turing machines, is the same as having oracle access to promise-BPP. First we construct a mapping that maps every function in APP to a promise problem in prBPP, and that maps complete functions to complete promise problems. Then we show an analogue result i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Complexity
سال: 1998
ISSN: 1016-3328,1420-8954
DOI: 10.1007/s000370050007